Path Planning for General Aircrafts Under Complex Scenarios Using an Improved NSGA-II Algorithm ⋆

نویسندگان

  • Jie ZENG
  • Xuejun ZHANG
  • Xiangmin GUAN
  • I. K. Nikolos
چکیده

General aviation rapidly becomes blossom with the growing economy. However, the complex flying environment and the flexibility for general aircrafts cause more difficulty to ensure the flying safety and efficiency. Hence it is vital to plan path for aircrafts to keep them away from threat and reduce fuel consumption. In this paper, we propose a path planning method based on an improved Nondominated Sorting Genetic Algorithm (NSGA-II) to generate ideal paths for aircraft(s) in a 2-D space to avoid conflict, prohibited flying zones and risk areas. In our method, the adaptive adjustment strategy for crossover and mutation is introduced to accelerate the computation speed and improve the solutions quality. Empirical studies under different scenarios with multiple aircrafts demonstrate that our algorithm can improve solution quality effectively and efficiently.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-objective Pareto optimization of bone drilling process using NSGA II algorithm

Bone drilling process is one the most common processes in orthopedic surgeries and bone breakages treatment. It is also very frequent in dentistry and bone sampling operations. Bone is a complex material and the machining process itself is sensitive so bone drilling is one of the most important, common and sensitive processes in Biomedical Engineering field. Orthopedic surgeries can be improved...

متن کامل

Minimizing the total tardiness and makespan in an open shop scheduling problem with sequence-dependent setup times

We consider an open shop scheduling problem with setup and processing times separately such that not only the setup times are dependent on the machines, but also they are dependent on the sequence of jobs that should be processed on a machine. A novel bi-objective mathematical programming is designed in order to minimize the total tardiness and the makespan. Among several mult...

متن کامل

Using NSGA II Algorithm for a Three Objectives Redundancy Allocation Problem with k-out-of-n Sub-Systems

in the new production systems, finding a way to improving the product and system reliability in design is a very important. The reliability of the products and systems may improve using different methods. One of this methods is redundancy allocation problem. In this problem by adding redundant component to sub-systems under some constraints, the reliability improved. In this paper we worked on ...

متن کامل

A MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM USING DECOMPOSITION (MOEA/D) AND ITS APPLICATION IN MULTIPURPOSE MULTI-RESERVOIR OPERATIONS

This paper presents a Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) for the optimal operation of a complex multipurpose and multi-reservoir system. Firstly, MOEA/D decomposes a multi-objective optimization problem into a number of scalar optimization sub-problems and optimizes them simultaneously. It uses information of its several neighboring sub-problems for optimizin...

متن کامل

Mathematical Formulation and Solving of Green Closed-loop Supply Chain Planning Problem with Production, Distribution and Transportation Reliability

In this paper, developed a new multi-product, multi-period, and multi-level closed-loop green supply chain planning model under uncertain conditions. The formulated model consists of five objective functions, which minimize the cost of the supply chain, minimize the CO2 emission of transportation vehicles, maximize the reliability of manufacturing and distribution centers, maximize t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013